翻訳と辞書 Words near each other ・ Paithalmala ・ Pairing ・ Pairing (computing) ・ Pairing function ・ Pairing heap ・ Pairing Off ・ Pairing-based cryptography ・ Pairis Abbey ・ Pairoj Borwonwatanadilok ・ Pairote Pongjan ・ Pairote Sokam ・ PAIRS Foundation ・ Pairs in Test and first-class cricket ・ Pairs trade ・ Pairwise ・ Pairwise Algorithm ・ Pairwise comparison ・ Pairwise error probability ・ Pairwise independence ・ Pairwise sorting network ・ Pairwise Stone space ・ Pairwise summation ・ Pairwise testing ・ PAIS ・ Pais ・ Pais (moth) ・ PAIS Alliance ・ Pais de los Maynas ・ Pais Maravilla ・ Pais Movement Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Pairwise Algorithm ： ウィキペディア英語版 Pairwise Algorithm A Pairwise Algorithm is an algorithmic technique with its origins in Dynamic programming. Pairwise algorithms have several uses including comparing a protein profile (a residue scoring matrix for one or more aligned sequences) against the three translation frames of a DNA strand, allowing frameshifting. The most remarkable feature of PairWise as compared to other Protein-DNA alignment tools is that PairWise allows frameshifting during alignment. == History == One of the earliest applications of PairWise to problems in bioinformatics was by Ewan Birney. Frameshifting refers to the phenomena where in one DNA strands, there are more than one translation frame. For normal Protein-DNA alignment tools, they first choose one of three frames to translate the DNA into a protein sequence, and then compare it with the given protein. Such alignment is based on the assumption that the DNA translation frame is not interrupted for the whole DNA strand. However, this is not generally true. The PairWise algorithm is a variant of the Smith–Waterman algorithm best local alignment algorithm. These algorithms all belong to the class known as minimal string edit algorithms. The main differences between PairWise and other alignment algorithm is that, besides normal penalties such as Gap Opening Penalty (GOP), Gap Extension Penalty (GEP) and Match, PairWise introduced two new penalties called Frame Opening Penalty (FOP) and Frame Extension Penalty (FEP), which will be incurred when a frameshift is accepted and extended respectively. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Pairwise Algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.